Understanding Voting for Committees Using Wreath Products
نویسندگان
چکیده
In this thesis, we construct an algebraic framework for analyzing committee elections. In this framework, module homomorphisms are used to model positional voting procedures. Using the action of the wreath product group S2[Sn] on these modules, we obtain module decompositions which help us to gain an understanding of the module homomorphism. We use these decompositions to construct some interesting voting paradoxes.
منابع مشابه
Restricted cascade and wreath products of fuzzy finite switchboard state machines
A finite switchboard state machine is a specialized finite state machine. It is built by binding the concepts of switching state machines and commutative state machines. The main purpose of this paper is to give a specific algorithm for fuzzy finite switchboard state machine and also, investigates the concepts of switching relation, covering, restricted cascade products and wreath products of f...
متن کاملThe Complexity of Multiwinner Voting Rules with Variable Number of Winners
We consider the approval-based model of elections, and undertake a computational study of voting rules which select committees whose size is not predetermined. While voting rules that output committees with a predetermined number of winning candidates are quite well studied, the study of elections with variable number of winners has only recently been initiated by Kilgour [18]. This paper aims ...
متن کاملParticipation and voting outcomes in committees: Evidence from the ILO
Although many international organisation are formally built on the principle of „one country―one vote“, a lack of representativeness in decision-making may give a subgroup of members disproportionate influence on the organisation’s policies. Using data on participation and voting in 51 decision-making committees of the International Labour Organization (ILO), we do find a bias in voting outcome...
متن کاملGraph-wreath products and finiteness conditionsI
A notion of graph-wreath product of groups is introduced. We obtain sufficient conditions for these products to satisfy the topologically inspired finiteness condition type Fn. Under various additional assumptions we show that these conditions are necessary. Our results generalize results of Bartholdi, Cornulier and Kochloukova about wreath products. Graphwreath products of groups include class...
متن کاملProposal : Electing Committees Stephen C
Extensive work has been done to expose and analyze the flaws in common single-candidate election procedures. Arrow’s Theorem states that there exists no perfect voting procedure, so the existing research serves to compare and analyze existing voting systems as well as propose new systems. The problem of electing committees is clearly more complex; less research has been done to investigate the ...
متن کامل